Fast gradient vector flow computation based on augmented Lagrangian method
نویسندگان
چکیده
Article history: Received 9 March 2012 Available online 4 October 2012 Communicated by G. Borgefors
منابع مشابه
An Augmented Lagrangian Dual Approach for the H-Weighted Nearest Correlation Matrix Problem
In [15], Higham considered two types of nearest correlation matrix problem, namely the W -weighted case and the H-weighted case. While the W -weighted case has since then been well studied to make several Lagrangian dual based efficient numerical methods available, the H-weighted case remains numerically challenging. The difficulty of extending those methods from the W -weighted case to the H-w...
متن کاملAn NLP Algorithm for Short Term Hydro Scheduling
This paper presents a method based on nonlinear programming for short term scheduling of hydro power system. The proposed algorithm is based on the solution of an augmented lagrangian function of the scheduling problem using conjugate gradient method. The water transportation delay between cascaded reservoirs is considered. Results concerning this method are compared with those achieved from su...
متن کاملA fast vector penalty-projection method for incompressible non-homogeneous or multiphase Navier-Stokes problems
We present a new fast vector penalty-projection method (VPPε) to efficiently compute the solution of unsteady NavierStokes problems governing incompressible multiphase viscous flows with variable density and/or viscosity. The key idea of the method is to compute at each time step an accurate and curl-free approximation of the pressure gradient increment in time. This method performs a two-step ...
متن کاملA Spectacular Vector Penalty-Projection Method for Darcy and Navier-Stokes Problems
We present a new fast vector penalty-projection method (VPPε ), issued from noticeable improvements of previous works [7, 3, 4], to efficiently compute the solution of unsteady Navier-Stokes/Brinkman problems governing incompressible multiphase viscous flows. The method is also efficient to solve anisotropic Darcy problems. The key idea of the method is to compute at each time step an accurate ...
متن کاملComputational Complexity of Inexact Gradient Augmented Lagrangian Methods: Application to Constrained MPC
We study the computational complexity certification of inexact gradient augmented Lagrangian methods for solving convex optimization problems with complicated constraints. We solve the augmented Lagrangian dual problem that arises from the relaxation of complicating constraints with gradient and fast gradient methods based on inexact first order information. Moreover, since the exact solution o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Pattern Recognition Letters
دوره 34 شماره
صفحات -
تاریخ انتشار 2013